Constructing Premaximal Binary Cube-free Words of Any Level
نویسندگان
چکیده
منابع مشابه
Constructing Premaximal Binary Cube-Free Words of any Level
The study of repetition-free words and languages remains quite popular in combinatorics of words: lots of interesting and challenging problems are still open. The most popular repetition-free binary languages are the cube-free language CF and the overlap-free language OF. The language CF is much bigger and has much more complicated structure. For example, the number of overlap-free binary words...
متن کاملBinary patterns in binary cube-free words: Avoidability and growth
The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growt...
متن کاملCounting Overlap-Free Binary Words
A word on a nite alphabet A is said to be overlap free if it contains no factor of the form xuxux where x is a letter and u a possibly empty word In this paper we study the number un of overlap free binary words of length n which is known to be bounded by a polynomial in n First we describe a bijection between the set of overlap free words and a rational language This yields recurrence relation...
متن کاملExtremal Infinite Overlap-Free Binary Words
Let t be the infinite fixed point, starting with 1, of the morphism μ : 0 → 01, 1→ 10. An infinite word over {0, 1} is said to be overlap-free if it contains no factor of the form axaxa, where a ∈ {0, 1} and x ∈ {0, 1}∗. We prove that the lexicographically least infinite overlap-free binary word beginning with any specified prefix, if it exists, has a suffix which is a suffix of t. In particula...
متن کاملExtremal Innnite Overlap-free Binary Words
Let t be the innnite xed point, starting with 1, of the morphism : 0 ! 01, 1 ! 10. An innnite word over f0;1g is said to be overlap-free if it contains no factor of the form axaxa, where a 2 f0;1g and x 2 f0;1g. We prove that the lexicographically least innnite overlap-free binary word beginning with any speciied preex, if it exists, has a suux which is a suux of t. In particular, the lexicogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2011
ISSN: 2075-2180
DOI: 10.4204/eptcs.63.23